منابع مشابه
A Variation on Selberg’s Approximation Problem
Let α ∈ C in the upper half-plane and let I be an interval. We construct an analogue of Selberg’s majorant of the characteristic function of I that vanishes at the point α. The construction is based on the solution to an extremal problem with positivity and interpolation constraints. Moreover, the passage from the auxiliary extremal problem to the construction of Selberg’s function with vanishi...
متن کاملOn approximation of the fully fuzzy fixed charge transportation problem
In the literature hardly any attention is paid to solving a fuzzy fixed charge transportation problem. In this paper, we consider the fully fixed-charge transportation problem and try to find both the lower and upper bounds on the fuzzy optimal value of such a problem in which all of the parameters are triangular fuzzy numbers. To illustrate the proposed method, a numerical example is presented.
متن کاملOn Bottleneck Product Rate Variation Problem with Batching
The product rate variation problem minimizes the variation in the rate at which different models of a common base product are produced on the assembly lines with the assumption of negligible switch-over cost and unit processing time for each copy of each model. The assumption of significant setup and arbitrary processing times forces the problem to be a two phase problem. The first phase determ...
متن کاملA Prisoner Problem Variation
The warden meets with 23 new prisoners when they arrive. He tells them, “You may meet today and plan a strategy. But after today, you will be in isolated cells and will have no communication with one another. “In the prison is a switch room, which contains two light switches labeled A and B, each of which can be in either the on or the off position. I am not telling you their present positions....
متن کاملOn a dyadic approximation of predictable processes of finite variation
We show that any càdlàg predictable process of finite variation is an a.s. limit of elementary predictable processes; it follows that predictable stopping times can be approximated ‘from below’ by predictable stopping times which take finitely many values. We then obtain as corollaries two classical theorems: predictable stopping times are announceable, and an increasing process is predictable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematika
سال: 2014
ISSN: 0025-5793,2041-7942
DOI: 10.1112/s0025579314000199